Multiway replacement selection sort with dynamic reservoir
نویسندگان
چکیده
منابع مشابه
Optimizing Sort in Hadoop Using Replacement Selection
This paper presents and evaluates an alternative sorting component for Hadoop based on the replacement selection algorithm. In comparison with the default quicksort-based implementation, replacement selection generates runs which are in average twice as large. This makes the merge phase more efficient, since the amount of data that can be merged in one pass increases in average by a factor of t...
متن کاملEnhanced Bidirectional Selection Sort
An algorithm is a well-defined procedure that takes some input in the form of some values, processes them and gives the desired output. It forms the basis of many other algorithms such as searching, pattern matching, digital filters etc., and other applications have been found in database systems, data statistics and processing, data communications and pattern matching. This paper introduces al...
متن کاملSort Me If You Can: How to Sort Dynamic Data
We formulate and study a new computational model for dynamic data. In this model the data changes gradually and the goal of an algorithm is to compute the solution to some problem on the data at each time step, under the constraint that it only has a limited access to the data each time. As the data is constantly changing and the algorithm might be unaware of these changes, it cannot be expecte...
متن کاملDynamic properties of a multiway arbiter
A multiway arbiter may be constructed from an interconnected structure of inverting gates which is a generalisation of the bistable flip-flop. Features of the dynamic behaviour of such a ‘multi-flop’ are illustrated by analysis and simulation based on a very simple non-linear dynamic model of each gate. Limitations of such a component as an arbiter are explained.
متن کاملPattern Recognition of the Selection Sort Algorithm
The field of program understanding attempts to determine the function of a code segment without programmer intervention and for this to occur, it is necessary to have a model (plan) against which to attempt to match the code segment of interest. This paper traces in detail the pattern recognition of the selection sort algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1977
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/20.4.298